Updating Disjunctive Databases via Model Trees *
نویسنده
چکیده
In this paper we study the problem of updating disjunctive databases, which contain indefinite data given as positive disjunctive clauses. We give correct algorithms for the insertion of a clause into and the deletion of a clause from such databases. Although the algorithms presented here are oriented towards model trees, they apply to any representation of minimal models.
منابع مشابه
Disjunctive Databases via ModelTrees
In this paper we study the problem of updating disjunctive databases, which contain indeenite data given as positive disjunctive clauses. We give correct algorithms for the insertion of a clause into and the deletion of a clause from such databases. Although the algorithms presented here are oriented towards model trees, they apply to any representation of minimal models.
متن کاملProcessing Deductive Databases under the Disjunctive Stable Model Semantics
Cyclic covers are shown to characterise disjunctive stable models of unstratified deductive databases, and to facilitate top-down query processing, query compilation and view updating under the disjunctive stable model semantics. Such processing is shown to be more complex than comparable processing of stratified databases.
متن کاملUsing ACTs in Disjunctive Deductive Databases
This paper describes research eeorts to develop eecient implementation techniques for disjunctive deductive databases. The aim is to build a database engine that produces perfect model semantics as introduced by Przymusinski. When used with positive dis-junctive databases the results would be equivalent to that of minimal model semantics. Our strategy is to build Access Clause Trees (ACTs) base...
متن کاملComputing Perfect and Stable Model Using Ordered Model Trees
Ordered Model trees were introduced as a normal form for disjunctive deductive databases. They were also used to facilitate the computation of minimal models for disjunctive theories by exploiting the order imposed on the Herbrand base of the theory. In this work we show how the order on the Herbrand base can be used to compute perfect models of a disjunctive stratiied nite theory. We are able ...
متن کاملA Transformation-Based Approach to View Updating in Stratifiable Deductive Databases
In this paper we present a new rule-based approach for consistency preserving view updating in deductive databases. Based on rule transformations performed during schema design, fixpoint evaluations of these rules at run time compute consistent realizations of view update requests. Alternative realizations are expressed using disjunctive Datalog internally. The approach extends and integrates s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995